G-PCCA: Spectral Clustering for Non-reversible Markov Chains
نویسندگان
چکیده
Spectral clustering methods are based on solving eigenvalue problems for the identification of clusters, e.g., the identification of metastable subsets of a Markov chain. Usually, real-valued eigenvectors are mandatory for this type of algorithms. The Perron Cluster Analysis (PCCA+) is a well-known spectral clustering method of Markov chains. It is applicable for reversible Markov chains, because reversibility implies a real-valued spectrum. We extend this spectral clustering method also to non-reversible Markov chains and give some illustrative examples. The main idea is to replace the eigenvalue problem by a real-valued Schur decomposition. By this extension, non-reversible Markov chains can be analyzed. Furthermore, the chains need not have a positive stationary distribution. And additionally to metastabilities, dominant cycles and sinks can be identified, too. ∗[email protected] †[email protected]
منابع مشابه
Geometric Ergodicity and the Spectral Gap of Non-Reversible Markov Chains
We argue that the spectral theory of non-reversible Markov chains may often be more effectively cast within the framework of the naturally associated weighted-L∞ space L V ∞ , instead of the usual Hilbert space L2 = L2(π), where π is the invariant measure of the chain. This observation is, in part, based on the following results. A discrete-time Markov chain with values in a general state space...
متن کاملweak-reversible Markov chains
The theory of L-spectral gaps for reversible Markov chains has been studied by many authors. In this paper we consider positive recurrent general state space Markov chains with stationary transition probabilities. Replacing the assumption of reversibility by a less strong one, we still obtain a simple necessary and sufficient condition for the spectral gap property of the associated Markov oper...
متن کاملSpectrum of large random reversible Markov chains: two examples
We take on a Random Matrix theory viewpoint to study the spectrum of certain reversible Markov chains in random environment. As the number of states tends to infinity, we consider the global behavior of the spectrum, and the local behavior at the edge, including the so called spectral gap. Results are obtained for two simple models with distinct limiting features. The first model is built on th...
متن کاملApplications of geometric bounds to the convergence rate of Markov chains on Rn
Quantitative geometric rates of convergence for reversible Markov chains are closely related to the spectral gap of the corresponding operator, which is hard to calculate for general state spaces. This article describes a geometric argumen t to give di erent types of bounds for spectral gaps of Markov chains on bounded subsets of R and to compare the rates of convergence of di erent Markov chai...
متن کاملA Robust Spectral Method for Finding Lumpings and Meta Stable States of Non-reversible Markov Chains
Abstract. A spectral method for identifying lumping in large Markov chains is presented. Identification of meta stable states is treated as a special case. The method is based on spectral analysis of a self-adjoint matrix that is a function of the original transition matrix. It is demonstrated that the technique is more robust than existing methods when applied to noisy non-reversible Markov ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015